On Cones of Nonnegative Quadratic Functions

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Cones of Nonnegative Quadratic Functions

We derive LMI-characterizations and dual decomposition algorithms for certain matrix cones which are generated by a given set using generalized co-positivity. These matrix cones are in fact cones of non-convex quadratic functions that are nonnegative on a certain domain. As a domain, we consider for instance the intersection of a (upper) level-set of a quadratic function and a halfplane. Conseq...

متن کامل

Cones of Nonnegative Quadratic Pseudo-Boolean Functions

Numerous combinatorial optimization problems can be formulated as the minimization of a quadratic pseudo-Boolean function in n variables, which on its own turn is equivalent with a linear programming problem over the so called Boolean Quadric Polytope (BQ) in n+ ( 2 2 ) dimension (Padberg, 1989). This polytope is very well studied, still we know in fact very little about its structure and its f...

متن کامل

On Cones of Nonnegative Quartic Forms

Historically, much of the theory and practice in nonlinear optimization has revolved around the quadratic models. Though quadratic functions are nonlinear polynomials, they are well structured and easy to deal with. Limitations of the quadratics, however, become increasingly binding as higher degree nonlinearity is imperative in modern applications of optimization. In the recent years, one obse...

متن کامل

On flocks of infinite quadratic cones

We extend some of the theory of flocks of a finite quadratic cone to the infinite case and give some examples. One of the results we prove is that a generalized quadrangle is coming from a flock if and only if all derivations of the flock are well defined.

متن کامل

study of hash functions based on chaotic maps

توابع درهم نقش بسیار مهم در سیستم های رمزنگاری و پروتکل های امنیتی دارند. در سیستم های رمزنگاری برای دستیابی به احراز درستی و اصالت داده دو روش مورد استفاده قرار می گیرند که عبارتند از توابع رمزنگاری کلیددار و توابع درهم ساز. توابع درهم ساز، توابعی هستند که هر متن با طول دلخواه را به دنباله ای با طول ثابت تبدیل می کنند. از جمله پرکاربردترین و معروف ترین توابع درهم می توان توابع درهم ساز md4, md...

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematics of Operations Research

سال: 2003

ISSN: 0364-765X,1526-5471

DOI: 10.1287/moor.28.2.246.14485